#include"AVL_tree.h"

int main()
{
	int a[] = { 16, 3, 7, 11, 9, 26, 18, 14, 15 };
	AVL_tree<int, int> t;
	for (auto e : a)
	{
		t.insert(make_pair(e, e));
	}
	t.in_order();
	cout << endl;

	cout << t.is_avl_tree() << endl;

	return 0;
}